Rewriting P Systems with Conditional Communication: Improved Hierarchies
نویسندگان
چکیده
We consider here a variant of rewriting P systems [1], where communication is controlled by the contents of the strings, not by the evolution rules used for obtaining these strings. Some new characterizations of recursively enumerable languages are obtained by means of P systems with a small number of membranes, which improves some of the known results from [1] and [4].
منابع مشابه
On Communication Complexity in Evolution-Communication P Systems
Looking for a theory of communication complexity for P systems, we consider here so-called evolution-communication (EC for short) P systems, where objects evolve by multiset rewriting rules without target commands and pass through membranes by means of symport/antiport rules. (Actually, in most cases below we use only symport rules.) We first propose a way to measure the communication costs by ...
متن کاملRelative Undecidability in Term Rewriting
For two hierarchies of properties of term rewriting systems related to con uence and termination, respectively, we prove relative undecidability : for implications X ) Y in the hierarchies the property X is undecidable for term rewriting systems satisfying Y .
متن کاملRewriting P Systems with Conditional Communication
A membrane system (P system) is a model of computation inspired by some basic features of the structure and behaviour of living cells. In this paper we consider systems with string-objects processed by rewriting, with the communication controlled by conditions on the contents of the strings. Symbols, substrings (in an arbitrary place, or as a prefix/suffix), or the shape of the whole string are...
متن کاملSound Structure-Preserving Transformation for Weakly-Left-Linear Deterministic Conditional Term Rewriting Systems
In this paper, we show that the SR transformation, a computationally equivalent transformation proposed by Şerbănuţă and Roşu, is a sound structure-preserving transformation for weakly-left-linear deterministic conditional term rewriting systems. More precisely, we show that every weakly-leftlinear deterministic conditional term rewriting system can be converted to an equivalent weakly-leftline...
متن کاملConfluence of Conditional Term Rewrite Systems via Transformations
Conditional term rewriting is an intuitive yet complex extension of term rewriting. In order to benefit from the simpler framework of unconditional rewriting, transformations have been defined to eliminate the conditions of conditional term rewrite systems. Recent results provide confluence criteria for conditional term rewrite systems via transformations, yet they are restricted to CTRSs with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computing and Informatics
دوره 27 شماره
صفحات -
تاریخ انتشار 2008